Salient Region Detection with Convex Hull Overlap

نویسندگان

  • YongQing Liang
  • Cheng Jin
  • Yuejie Zhang
چکیده

In this paper, we establish a novel bottom-up cue named Convex Hull Overlap (CHO), and then propose an effective approach to detect salient regions using the combination of the CHO cue and global contrast cue. Our scheme significantly differs from other earlier work in: 1) The hierarchical segmentation model based on Normalized Graph-Cut fits the splitting and merging processes in human visual perception; 2) Previous work only focuses on color and texture cues, while our CHO cue makes up the obvious gap between the spatial region covering and the region saliency. CHO is a kind of improved and enhanced Gestalt cue, while other popular figure-ground cues such as convexity and surroundedness can be regarded as the special cases of CHO. Our experiments on a large number of public data have obtained very positive results. CCS Concepts • Computing methodologies➝Artificial intelligence➝ Computer vision➝Computer vision problems➝Interest point and salient region detections.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Salient-SIFT for Image Retrieval

Local descriptors have been wildly explored and utilized in image retrieval because of their transformation invariance. In this paper, we propose an improved set of features extarcted from local descriptors for more effective and efficient image retrieval. We propose a salient region selection method to detect human’s Region Of Interest (hROI) from an image, which incorporates the Canny edge al...

متن کامل

Building Detection and Recognition from High Resolution Remotely Sensed Imagery

This paper supposes a schema to deal with the tough task of building detection and recognition from high resolution remotely sensed imagery. It is a region-based and semi-automatic schema combining with Hough transform and computation of convex hull of the pixels contained in the building areas, which can produce a precise result when the contrast between flat building rooftop and the backgroun...

متن کامل

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

L-CONVEX SYSTEMS AND THE CATEGORICAL ISOMORPHISM TO SCOTT-HULL OPERATORS

The concepts of $L$-convex systems and Scott-hull spaces are proposed on frame-valued setting. Also, we establish the categorical isomorphism between  $L$-convex systems and Scott-hull spaces. Moreover, it is proved that the category of $L$-convex structures is  bireflective in the category of $L$-convex systems. Furthermore, the quotient systems of $L$-convex systems are studied.

متن کامل

Robust and E cient Detection of Convex Groups 1

This paper describes an algorithm that robustly locates convex collections of line segments in an image. The algorithm is guaranteed to nd all convex sets of line segments in which the length of the line segments accounts for at least some xed proportion of the length of their convex hull. This enables the algorithm to nd convex groups whose contours are partially occluded or missing due to noi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1612.03284  شماره 

صفحات  -

تاریخ انتشار 2016